
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1687. -- [Usaco2005 Open]Navigating the City -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1687: [Usaco2005 Open]Navigating the City</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>29&nbsp;&nbsp;<span class=green>Solved: </span>20<br>[<a href='submitpage.php?id=1687'>Submit</a>][<a href='problemstatus.php?id=1687'>Status</a>][<a href='bbs.php?id=1687'>Discuss</a>]</center><h2>Description</h2><div class=content>A dip in the milk market has forced the cows to move to the city.
The only employment available is in the venerable field of taxi-driving.
Help the cows learn their way around the city.

Given a city map with E (1 <= E <= 40) east/west street locations
and N (1 <= N <= 30) north/south street locations, create instructions
for a taxi driver to navigate from the start of his route (marked
'S') to the end (marked 'E'). Each instruction is a direction (one
of 'N', 'E', 'S', or 'W') followed by a space followed by an integer
that tells how many blocks to drive in that direction. If multiple
routes are available, your program should output the shortest route.
The shortest route is guaranteed to exist and be unique.

The map is depicted as a grid of '+'s that represent intersections
and a set of roads depicted as '-' and '|'.  Buildings and other
obstacles are shown as '.'s. Here is a typical map:

+-+-+.+-+-+
|...|.....|
+-+.+-+-+-+
..|.......|
S-+-+-+.E-+

The taxi should go east, north, west, north, east two blocks, and so on. 
See the output format and sample solution below for its complete route.

从S开车到E."-"代表是道路,"."不可以走,请找出一条路线出来.
</div><h2>Input</h2><div class=content>* Line 1: Two space-separated integers, N and E.

* Lines 2..2*N: These lines each contain 2*E-1 characters and encode
        the map of the street. Every other input line gives the data
        for the east/west streets; the remaining lines show the
        north/south streets. The format should be clear from the
        example.

</div><h2>Output</h2><div class=content>* Lines 1..?: Each line contains a direction letter and a number of
        blocks to travel in that direction.
</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>3 6<br />
+-+-+.+-+-+<br />
|...|.....|<br />
+-+.+-+-+-+<br />
..|.......|<br />
S-+-+-+.E-+<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>E 1<br />
N 1<br />
W 1<br />
N 1<br />
E 2<br />
S 1<br />
E 3<br />
S 1<br />
W 1<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Silver'>Silver</a></p></div><center>[<a href='submitpage.php?id=1687'>Submit</a>][<a href='problemstatus.php?id=1687'>Status</a>][<a href='bbs.php?id=1687'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
